Robust random number generation for peer-to-peer systems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust Random Number Generation for Peer-to-Peer Systems

We consider the problem of designing an efficient and robust distributed random number generator for peer-to-peer systems that is easy to implement and works even if all communication channels are public. A robust random number generator is crucial for avoiding adversarial join-leave attacks on peer-to-peer overlay networks. We show that our new generator together with a light-weight rule recen...

متن کامل

Constructing Robust Dynamic Peer-to-Peer Systems

Until now, the analysis of fault tolerance of peerto-peer systems usually only covers random faults of some kind. Contrary to traditional algorithmic research, faults as well as joins and leaves occurring in a worst-case manner are hardly considered. In this paper, we devise techniques to build dynamic peer-to-peer systems which remain fully functional in spite of an adversary which continuousl...

متن کامل

Towards Next-Generation Peer-to-Peer Systems

The Internet has changed from a statically, television-like web page space to a highly heterogeneous and extremely dynamic information platform. No other technology forced that development like Peer-to-Peer. This short paper will briefly summarize emerging trends and promising concepts for Peer-to-Peer systems and describe upcoming challenges for developers.

متن کامل

Robust Reputations for Peer-to-Peer Marketplaces

We have developed a suite of algorithms to address two large problems confronting reputation systems for large peer-topeer markets: data sparseness and inaccurate feedback. To handle sparse data, we propose a Bayesian version of the well-known Percent Positive Feedback system. To mitigate the effect of inaccurate feedback – particularly retaliatory negative feedback – we propose EM-trust, which...

متن کامل

Random Graphs for Peer-to-Peer Overlays

Modern peer-to-peer networks consist of several network layers and distributed algorithms providing features like indexing, ressource balancing, entry protocols, security, anonymity, and cryptography. Since peer-to-peer networks are highly dynamic, a fundamental task in the design of these networks is to provide high connectivity. We propose a solution by distributed random link exchange algori...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2009

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2008.10.003